Tight MIP formulations of the power-based unit commitment problem
نویسندگان
چکیده
منابع مشابه
Tight MIP formulations of the power-based unit commitment problem
This paper provides the convex hull description for the basic operation of slowand quick-start units in power-based unit commitment (UC) problems. The basic operating constraints that are modeled for both types of units are (1) generation limits and (2) minimum up and down times. Apart from this, the startup and shutdown processes are also modeled, using (3) startup and shutdown power trajector...
متن کاملA tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
This paper provides the convex hull description for the following basic operating constraints of a single power generation unit in Unit Commitment (UC) problems: 1) generation limits, 2) startup and shutdown capabilities, and 3) minimum up and down times. Although the model does not consider some crucial constraints, such as ramping, the proposed constraints can be used as the core of any UC fo...
متن کاملAn Improved MIP Formulation for the Unit Commitment Problem
In this paper, we present an MIP formulation for the Unit Commitment problem that leads to significant computational time savings and almost-integral solutions when compared to the state-of-the-art formulations in the literature. Using a variety of test instances from the literature, we provide empirical evidence that the polyhedral structure of the new formulation is tighter than the polyhedra...
متن کاملsolution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
MIP Formulations for the Steiner Forest Problem
The Steiner Forest problem is among the fundamental network design problems. Finding tight linear programmming bounds for the problem is the key for both fast Branch-and-Bound algorithms and good primal-dual approximations. On the theoretical side, the best known bound can be obtained from an integer program by Könemann, Leonardi, Schäfer and van Zwam [KLSv08]. It guarantees a value that is a (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: OR Spectrum
سال: 2015
ISSN: 0171-6468,1436-6304
DOI: 10.1007/s00291-015-0400-4